On the power of lookahead in on-line server routing problems

نویسندگان

Luca Allulli

Giorgio Ausiello

Vincenzo Bonifaci

Luigi Laura

چکیده

We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited ability to foresee future requests, what is the improvement that can be achieved in terms of the competitive ratio? We consider several online server routing problems in this setting, such as the online traveling salesman and the online traveling repairman problem. We show that the influence of lookahead can change considerably depending on the particular objective function and metric space considered.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Power of Lookahead in On-Line Vehicle Routing Problems

Vehicle Routing Problems are generalizations of the well known Traveling Salesman Problem; we focus on the on-line version of these problems, where requests are not known in advance and arrive over time. We introduce a model of lookeahead for this class of problems, the time lookahead ∆, which allows an on-line algorithm to foresee all the requests that will be released during next ∆ time units...

متن کامل

The influence of lookahead in competitive on-line algorithms

In the competitive analysis of on-line problems, an on-line algorithm is presented with a sequence of requests to be served. The on-line algorithm must satisfy each request without the knowledge of any future requests. We consider the question of lookahead in on-line problems: What improvement can be achieved in terms of competitiveness, if the on-line algorithm sees not only the present reques...

متن کامل

A Novel Method for VANET Improvement using Cloud Computing

In this paper, we present a novel algorithm for VANET using cloud computing. We accomplish processing, routing and traffic control in a centralized and parallel way by adding one or more server to the network. Each car or node is considered a Client, in such a manner that routing, traffic control, getting information from client and data processing and storing are performed by one or more serve...

متن کامل

A New Method for Solving Constraint Satisfaction Problems

Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...

متن کامل